On the Minimum Norm
نویسندگان
چکیده
This paper describes a new technique to nd the minimum norm solution of a linear program. The main idea is to reformulate this problem as an unconstrained minimization problem with a convex and smooth objective function. The minimization of this objective function can be carried out by a Newton-type method which is shown to be globally convergent. Furthermore, under certain assumptions, this Newton-type method converges in a nite number of iterations to the minimum norm solution of the underlying linear program.
منابع مشابه
A Smoothing Technique for the Minimum Norm Solution of Absolute Value Equation
One of the issues that has been considered by the researchers in terms of theory and practice is the problem of finding minimum norm solution. In fact, in general, absolute value equation may have infinitely many solutions. In such cases, the best and most natural choice is the solution with the minimum norm. In this paper, the minimum norm-1 solution of absolute value equation is investigated. ...
متن کاملIterative scheme based on boundary point method for common fixed point of strongly nonexpansive sequences
Let $C$ be a nonempty closed convex subset of a real Hilbert space $H$. Let ${S_n}$ and ${T_n}$ be sequences of nonexpansive self-mappings of $C$, where one of them is a strongly nonexpansive sequence. K. Aoyama and Y. Kimura introduced the iteration process $x_{n+1}=beta_nx_n+(1-beta_n)S_n(alpha_nu+(1-alpha_n)T_nx_n)$ for finding the common fixed point of ${S_n}$ and ${T_n}$, where $uin C$ is ...
متن کاملAn Analytical Model for Predicting the Convergence Behavior of the Least Mean Mixed-Norm (LMMN) Algorithm
The Least Mean Mixed-Norm (LMMN) algorithm is a stochastic gradient-based algorithm whose objective is to minimum a combination of the cost functions of the Least Mean Square (LMS) and Least Mean Fourth (LMF) algorithms. This algorithm has inherited many properties and advantages of the LMS and LMF algorithms and mitigated their weaknesses in some ways. The main issue of the LMMN algorithm is t...
متن کاملPerturbation bounds for $g$-inverses with respect to the unitarily invariant norm
Let complex matrices $A$ and $B$ have the same sizes. Using the singular value decomposition, we characterize the $g$-inverse $B^{(1)}$ of $B$ such that the distance between a given $g$-inverse of $A$ and the set of all $g$-inverses of the matrix $B$ reaches minimum under the unitarily invariant norm. With this result, we derive additive and multiplicative perturbation bounds of the nearest per...
متن کاملSTONE DUALITY FOR R0-ALGEBRAS WITH INTERNAL STATES
$Rsb{0}$-algebras, which were proved to be equivalent to Esteva and Godo's NM-algebras modelled by Fodor's nilpotent minimum t-norm, are the equivalent algebraic semantics of the left-continuous t-norm based fuzzy logic firstly introduced by Guo-jun Wang in the mid 1990s.In this paper, we first establish a Stone duality for the category of MV-skeletons of $Rsb{0}$-algebras and the category of t...
متن کاملMax-Min averaging operator: fuzzy inequality systems and resolution
Minimum and maximum operators are two well-known t-norm and s-norm used frequently in fuzzy systems. In this paper, two different types of fuzzy inequalities are simultaneously studied where the convex combination of minimum and maximum operators is applied as the fuzzy relational composition. Some basic properties and theoretical aspects of the problem are derived and four necessary and suffi...
متن کامل